Higher-Order Termination: From Kruskal to Computability
Identifieur interne : 005470 ( Main/Exploration ); précédent : 005469; suivant : 005471Higher-Order Termination: From Kruskal to Computability
Auteurs : Frédéric Blanqui [France] ; Jean-Pierre Jouannaud [France] ; Albert Rubio [Espagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
English descriptors
- mix :
Abstract
Abstract: Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination). In computer science, termination has always been an important issue for showing programs correct. In the early days of logic, strong normalization was usually shown by assigning ordinals to expressions in such a way that eliminating a cut would yield an expression with a smaller ordinal. In the early days of verification, computer scientists used similar ideas, interpreting the arguments of a program call by a natural number, such as their size. Showing the size of the arguments to decrease for each recursive call gives a termination proof of the program, which is however rather weak since it can only yield quite small ordinals. In the sixties, Tait invented a new method for showing cut elimination of natural deduction, based on a predicate over the set of terms, such that the membership of an expression to the predicate implied the strong normalization property for that expression. The predicate being defined by induction on types, or even as a fixpoint, this method could yield much larger ordinals. Later generalized by Girard under the name of reducibility or computability candidates, it showed very effective in proving the strong normalization property of typed lambda-calculi with polymorphic types, dependent types, inductive types, and finally a cumulative hierarchy of universes. On the programming side, research on termination shifted from programming to executable specification languages based on rewriting, and concentrated on automatable methods based on the construction on well-founded orderings of the set of terms. The milestone here is Dershowitz’s recursive path ordering (RPO), in the late seventies, whose well-foundedness proof is based on a powerful combinatorial argument, Kruskal’s tree theorem, which also yields rather large ordinals. While the computability predicates must be defined for each particular case, and their properties proved by hand, the recursive path ordering can be effectively automated.
Url:
DOI: 10.1007/11916277_1
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003888
- to stream Istex, to step Curation: 003845
- to stream Istex, to step Checkpoint: 001323
- to stream Hal, to step Corpus: 002799
- to stream Hal, to step Curation: 002799
- to stream Hal, to step Checkpoint: 003E57
- to stream Main, to step Merge: 005616
- to stream Main, to step Curation: 005470
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Higher-Order Termination: From Kruskal to Computability</title>
<author><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name>
</author>
<author><name sortKey="Jouannaud, Jean Pierre" sort="Jouannaud, Jean Pierre" uniqKey="Jouannaud J" first="Jean-Pierre" last="Jouannaud">Jean-Pierre Jouannaud</name>
</author>
<author><name sortKey="Rubio, Albert" sort="Rubio, Albert" uniqKey="Rubio A" first="Albert" last="Rubio">Albert Rubio</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:ED7C0F43B844F81440F270D91B870E75177C0DF5</idno>
<date when="2006" year="2006">2006</date>
<idno type="doi">10.1007/11916277_1</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-M6XH8N7K-9/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">003888</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003888</idno>
<idno type="wicri:Area/Istex/Curation">003845</idno>
<idno type="wicri:Area/Istex/Checkpoint">001323</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001323</idno>
<idno type="wicri:doubleKey">0302-9743:2006:Blanqui F:higher:order:termination</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00091308</idno>
<idno type="url">https://hal.inria.fr/inria-00091308</idno>
<idno type="wicri:Area/Hal/Corpus">002799</idno>
<idno type="wicri:Area/Hal/Curation">002799</idno>
<idno type="wicri:Area/Hal/Checkpoint">003E57</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">003E57</idno>
<idno type="wicri:Area/Main/Merge">005616</idno>
<idno type="wicri:Area/Main/Curation">005470</idno>
<idno type="wicri:Area/Main/Exploration">005470</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Higher-Order Termination: From Kruskal to Computability</title>
<author><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>INRIA & LORIA, BP 101, 54602 CEDEX, Villiers-lés-Nancy</wicri:regionArea>
<wicri:noRegion>Villiers-lés-Nancy</wicri:noRegion>
<wicri:noRegion>Villiers-lés-Nancy</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Jouannaud, Jean Pierre" sort="Jouannaud, Jean Pierre" uniqKey="Jouannaud J" first="Jean-Pierre" last="Jouannaud">Jean-Pierre Jouannaud</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>LIX, École Polytechnique, 91400, Palaiseau</wicri:regionArea>
<placeName><region type="region" nuts="2">Île-de-France</region>
<settlement type="city">Palaiseau</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Rubio, Albert" sort="Rubio, Albert" uniqKey="Rubio A" first="Albert" last="Rubio">Albert Rubio</name>
<affiliation wicri:level="3"><country xml:lang="fr">Espagne</country>
<wicri:regionArea>Technical University of Catalonia, Pau Gargallo 5, 08028, Barcelona</wicri:regionArea>
<placeName><settlement type="city">Barcelone</settlement>
<region nuts="2" type="region">Catalogne</region>
</placeName>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>horpo</term>
<term>lambda-calculus</term>
<term>ordering</term>
<term>termination</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination). In computer science, termination has always been an important issue for showing programs correct. In the early days of logic, strong normalization was usually shown by assigning ordinals to expressions in such a way that eliminating a cut would yield an expression with a smaller ordinal. In the early days of verification, computer scientists used similar ideas, interpreting the arguments of a program call by a natural number, such as their size. Showing the size of the arguments to decrease for each recursive call gives a termination proof of the program, which is however rather weak since it can only yield quite small ordinals. In the sixties, Tait invented a new method for showing cut elimination of natural deduction, based on a predicate over the set of terms, such that the membership of an expression to the predicate implied the strong normalization property for that expression. The predicate being defined by induction on types, or even as a fixpoint, this method could yield much larger ordinals. Later generalized by Girard under the name of reducibility or computability candidates, it showed very effective in proving the strong normalization property of typed lambda-calculi with polymorphic types, dependent types, inductive types, and finally a cumulative hierarchy of universes. On the programming side, research on termination shifted from programming to executable specification languages based on rewriting, and concentrated on automatable methods based on the construction on well-founded orderings of the set of terms. The milestone here is Dershowitz’s recursive path ordering (RPO), in the late seventies, whose well-foundedness proof is based on a powerful combinatorial argument, Kruskal’s tree theorem, which also yields rather large ordinals. While the computability predicates must be defined for each particular case, and their properties proved by hand, the recursive path ordering can be effectively automated.</div>
</front>
</TEI>
<affiliations><list><country><li>Espagne</li>
<li>France</li>
</country>
<region><li>Catalogne</li>
<li>Île-de-France</li>
</region>
<settlement><li>Barcelone</li>
<li>Palaiseau</li>
</settlement>
</list>
<tree><country name="France"><noRegion><name sortKey="Blanqui, Frederic" sort="Blanqui, Frederic" uniqKey="Blanqui F" first="Frédéric" last="Blanqui">Frédéric Blanqui</name>
</noRegion>
<name sortKey="Jouannaud, Jean Pierre" sort="Jouannaud, Jean Pierre" uniqKey="Jouannaud J" first="Jean-Pierre" last="Jouannaud">Jean-Pierre Jouannaud</name>
</country>
<country name="Espagne"><region name="Catalogne"><name sortKey="Rubio, Albert" sort="Rubio, Albert" uniqKey="Rubio A" first="Albert" last="Rubio">Albert Rubio</name>
</region>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005470 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 005470 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:ED7C0F43B844F81440F270D91B870E75177C0DF5 |texte= Higher-Order Termination: From Kruskal to Computability }}
This area was generated with Dilib version V0.6.33. |